Algebraic characterization of MDS group codes over cyclic groups

An (n, k) group code over a group G is a subset of G which forms a group under componentwise group operation and can be defined in terms of n — k homomorphisms from G to G. In this correspondence, the set of homomorphisms which define Maximum Distance Separable (MDS) group codes defined over cyclic groups are characterized. Each defining homomorphism can be specified by a set of k endomorpbisms of G. A matrix is associated with the k(n — k) defining endomorphisms of the code and necessary and sufficient conditions for this matrix to define an MDS code over cyclic groups is proved. Using this matrix characterization it is proved that over cyclic group with M elements, where M = pfp% •••pl ,(fc+s, k) MDS group codes, for all s, k>2, do not exist if max{s, k} > min{pi, pi, • • • ,pm}. Finally, it is shown that the dual code of an MDS group code over C M , a cyclic group with M elements, is also an MDS group code.